Full-text Search Engine Selection Support System
نویسندگان
چکیده
منابع مشابه
Extending Full Text Search Engine for Mathematical Content
The WWW became the main resource of mathematical knowledge. Currently available full text search engines can be used on these documents but they are deficient in almost all cases. By applying axioms, equal transformations, and by using different notation each formula can be expressed in numerous ways. Most of these documents do not contain semantic information; therefore, precise mathematical i...
متن کاملOntoSearch: A Full-Text Search Engine for the Semantic Web
OntoSearch, a full-text search engine that exploits ontological knowledge for document retrieval, is presented in this paper. Different from other ontology based search engines, OntoSearch does not require a user to specify the associated concepts of his/her queries. Domain ontology in OntoSearch is in the form of a semantic network. Given a keyword based query, OntoSearch infers the related co...
متن کاملApplication of Full Text Search Engine Based on Lucene
This paper introduces us the full-text search engine based on Lucene and full-text retrieval technology, including indexing and system architecture, compares the full-text search of Lucene with the String search retrieval’s response time, the experimental results show that the full text search of Lucene has faster retrieval speed.
متن کاملFull Text Search Engine as Scalable k-Nearest Neighbor Recommendation System
In this paper we present a method that allows us to use a generic full text engine as a k-nearest neighbor-based recommendation system. Experiments on two real world datasets show that accuracy of recommendations yielded by such system are comparable to existing spreading activation recommendation techniques. Furthermore, our approach maintains linear scalability relative to dataset size. We al...
متن کاملFine-grained Full-text Search
Most conventional text retrieval methods are designed to search for documents. However, users often do not require documents themselves, but are searching for specific information that may come from a large collection of texts quickly. To satisfy this need, we have developed a model and two methods for fine-grained searching. The unit of search in this model is called an atom, and it can be a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Joho Chishiki Gakkaishi
سال: 2011
ISSN: 1881-7661,0917-1436
DOI: 10.2964/jsik.21_11